Large scale detection of half-flats in CAT(0)-spaces
نویسندگان
چکیده
منابع مشابه
Large Scale Detection of Half-flats in Cat(0) Spaces
Let M be a complete locally compact CAT(0)-space, and X an ultralimit of M . For γ ⊂M a k-dimensional flat, let γω be the k-dimensional flat in X obtained as an ultralimit of γ. In this paper, we identify various conditions on γω that are sufficient to ensure that γ bounds a (k + 1)-dimensional half-flat. As applications we obtain (1) constraints on the behavior of quasi-isometries between loca...
متن کاملA TWO-STAGE METHOD FOR DAMAGE DETECTION OF LARGE-SCALE STRUCTURES
A novel two-stage algorithm for detection of damages in large-scale structures under static loads is presented. The technique utilizes the vector of response change (VRC) and sensitivities of responses with respect to the elemental damage parameters (RSEs). It is shown that VRC approximately lies in the subspace spanned by RSEs corresponding to the damaged elements. The property is leveraged in...
متن کاملLarge Scale Relation Detection
We present a technique for reading sentences and producing sets of hypothetical relations that the sentence may be expressing. The technique uses large amounts of instance-level background knowledge about the relations in order to gather statistics on the various ways the relation may be expressed in language, and was inspired by the observation that half of the linguistic forms used to express...
متن کاملapplication of brand personality scale in automobile industry: the study of samand’s brand personality dimensions
این تحقیق شخصیت برند سمند را در ایران با استفاده از مدل پنج بعدی آکر (1997) بعنوان یک چهارچوب بطور توصیفی سنجیده است. بنابر این چهارچوب که دراصل در 42 جزء (42 ویزگی شخصیتی) ودر پنج بعد شخصیتی طراحی شده بود ودر کشورها وصنایع مختلف آزموده شده بود, پرسنامه به زبان فارسی ترجمه شده و با استفاده از روشهای ترجمه معکوس و مصاحبه عمیق با 12 متخصص ایرانی به 38 جزء کاهش یافت. و نظرسنجی ای در پنج نمایندگی ا...
15 صفحه اولLarge-scale detection of repetitions.
Combinatorics on words began more than a century ago with a demonstration that an infinitely long string with no repetitions could be constructed on an alphabet of only three letters. Computing all the repetitions (such as ∙∙∙TTT ∙∙∙ or ∙∙∙ CGACGA ∙∙∙ ) in a given string x of length n is one of the oldest and most important problems of computational stringology, requiring time in the worst case...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indiana University Mathematics Journal
سال: 2010
ISSN: 0022-2518
DOI: 10.1512/iumj.2010.59.4348